package thss.mse12.lau.rsa.c;

/*
 *   Used to find p,q,n.
 *   @Author Liu Xinyu
 */
public class PrimeNumberGenerator {
	private static final int[] SMALL_PRIME_NUMS = { 2, 3, 5, 7, 11, 13, 17, 19,
			23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97,
			101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163,
			167, 173, 179, 181, 191 };

	public BigInteger getPrimeNum() {
		BigInteger candidate = new BigInteger(512);
		return candidate;
	}

	private boolean check(BigInteger candidate) {
		return false;
	}

}
